196 research outputs found
A max-type recursive model: some properties and open questions
We consider a simple max-type recursive model which was introduced in the
study of depinning transition in presence of strong disorder, by Derrida and
Retaux. Our interest is focused on the critical regime, for which we study the
extinction probability, the first moment and the moment generating function.
Several stronger assertions are stated as conjectures.Comment: A version accepted to Charles Newman Festschrift (to appear by
Springer
Matchings on infinite graphs
Elek and Lippner (2010) showed that the convergence of a sequence of
bounded-degree graphs implies the existence of a limit for the proportion of
vertices covered by a maximum matching. We provide a characterization of the
limiting parameter via a local recursion defined directly on the limit of the
graph sequence. Interestingly, the recursion may admit multiple solutions,
implying non-trivial long-range dependencies between the covered vertices. We
overcome this lack of correlation decay by introducing a perturbative parameter
(temperature), which we let progressively go to zero. This allows us to
uniquely identify the correct solution. In the important case where the graph
limit is a unimodular Galton-Watson tree, the recursion simplifies into a
distributional equation that can be solved explicitly, leading to a new
asymptotic formula that considerably extends the well-known one by Karp and
Sipser for Erd\"os-R\'enyi random graphs.Comment: 23 page
Packing and Hausdorff measures of stable trees
In this paper we discuss Hausdorff and packing measures of random continuous
trees called stable trees. Stable trees form a specific class of L\'evy trees
(introduced by Le Gall and Le Jan in 1998) that contains Aldous's continuum
random tree (1991) which corresponds to the Brownian case. We provide results
for the whole stable trees and for their level sets that are the sets of points
situated at a given distance from the root. We first show that there is no
exact packing measure for levels sets. We also prove that non-Brownian stable
trees and their level sets have no exact Hausdorff measure with regularly
varying gauge function, which continues previous results from a joint work with
J-F Le Gall (2006).Comment: 40 page
Random Planar Lattices and Integrated SuperBrownian Excursion
In this paper, a surprising connection is described between a specific brand
of random lattices, namely planar quadrangulations, and Aldous' Integrated
SuperBrownian Excursion (ISE). As a consequence, the radius r_n of a random
quadrangulation with n faces is shown to converge, up to scaling, to the width
r=R-L of the support of the one-dimensional ISE. More generally the
distribution of distances to a random vertex in a random quadrangulation is
described in its scaled limit by the random measure ISE shifted to set the
minimum of its support in zero.
The first combinatorial ingredient is an encoding of quadrangulations by
trees embedded in the positive half-line, reminiscent of Cori and Vauquelin's
well labelled trees. The second step relates these trees to embedded (discrete)
trees in the sense of Aldous, via the conjugation of tree principle, an
analogue for trees of Vervaat's construction of the Brownian excursion from the
bridge.
From probability theory, we need a new result of independent interest: the
weak convergence of the encoding of a random embedded plane tree by two contour
walks to the Brownian snake description of ISE.
Our results suggest the existence of a Continuum Random Map describing in
term of ISE the scaled limit of the dynamical triangulations considered in
two-dimensional pure quantum gravity.Comment: 44 pages, 22 figures. Slides and extended abstract version are
available at http://www.loria.fr/~schaeffe/Pub/Diameter/ and
http://www.iecn.u-nancy.fr/~chassain
The free energy in the Derrida--Retaux recursive model
We are interested in a simple max-type recursive model studied by Derrida and
Retaux (2014) in the context of a physics problem, and find a wide range for
the exponent in the free energy in the nearly supercritical regime
Digital Quantum Simulation of the Statistical Mechanics of a Frustrated Magnet
Many interesting problems in physics, chemistry, and computer science are
equivalent to problems of interacting spins. However, most of these problems
require computational resources that are out of reach by classical computers. A
promising solution to overcome this challenge is to exploit the laws of quantum
mechanics to perform simulation. Several "analog" quantum simulations of
interacting spin systems have been realized experimentally. However, relying on
adiabatic techniques, these simulations are limited to preparing ground states
only. Here we report the first experimental results on a "digital" quantum
simulation on thermal states; we simulated a three-spin frustrated magnet, a
building block of spin ice, with an NMR quantum information processor, and we
are able to explore the phase diagram of the system at any simulated
temperature and external field. These results serve as a guide for identifying
the challenges for performing quantum simulation on physical systems at finite
temperatures, and pave the way towards large scale experimental simulations of
open quantum systems in condensed matter physics and chemistry.Comment: 7 pages for the main text plus 6 pages for the supplementary
material
Scaling properties of protein family phylogenies
One of the classical questions in evolutionary biology is how evolutionary
processes are coupled at the gene and species level. With this motivation, we
compare the topological properties (mainly the depth scaling, as a
characterization of balance) of a large set of protein phylogenies with a set
of species phylogenies. The comparative analysis shows that both sets of
phylogenies share remarkably similar scaling behavior, suggesting the
universality of branching rules and of the evolutionary processes that drive
biological diversification from gene to species level. In order to explain such
generality, we propose a simple model which allows us to estimate the
proportion of evolvability/robustness needed to approximate the scaling
behavior observed in the phylogenies, highlighting the relevance of the
robustness of a biological system (species or protein) in the scaling
properties of the phylogenetic trees. Thus, the rules that govern the
incapability of a biological system to diversify are equally relevant both at
the gene and at the species level.Comment: Replaced with final published versio
- âŠ